Universal Point Sets for Drawing Planar Graphs with Circular Arcs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc. Submitted: October 2013 Reviewed: February 2014 Revised: March 2014 Accepted: April 2014 Final: May 2014 Published: May 2014 Article type: Regular paper Communicat...

متن کامل

Universal Point Sets for Planar Graph Drawings with Circular Arcs

We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.

متن کامل

Drawing Planar Graphs with Circular Arcs

In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...

متن کامل

On Universal Point Sets for Planar Graphs

A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...

متن کامل

Drawing Graphs with Few Arcs

Let G = (V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments. We ask for the smallest possible ground set of arcs/segments for a composite arc/segment-drawing. We present algorithms for constructing composite arc-drawin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Algorithms and Applications

سال: 2014

ISSN: 1526-1719

DOI: 10.7155/jgaa.00324